Learning classifiers that perform probabilistic classification under computational resource constraints

نویسندگان

  • Geoffrey I. Webb
  • Janice R. Boughton
  • Ying Yang
چکیده

Existing online machine learning techniques are often tuned to minimized computational resources, and are not able to utilize further resources when they are available. This is likely to result in sub-optimal learning performance in many online applications where the computational resources available will vary from time to time. This paper analyzes categories of computational resources and defines the problem of classification learning using varying and uncertain computational resources. An anytime classification algorithm AAODE is proposed. AAODE begins with the classification time and accuracy of naive Bayes and can increase classification accuracy when more time resource is given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning probabilistic classifiers under computational resource constraints

In many online applications of machine learning, the computational resources available will vary from time-to-time. Surprisingly, existing techniques are designed to accommodate the minimum expected resources, and fail to utilize further resources when they are available. This paper presents an analysis of the relevant categories of computational resource involved, and presents an algorithm tha...

متن کامل

A Probabilistic Model of Learning Fields in Islamic Economics and Finance

In this paper an epistemological model of learning fields of probabilistic events is formalized. It is used to explain resource allocation governed by pervasive complementarities as the sign of unity of knowledge. Such an episteme is induced epistemologically into interacting, integrating and evolutionary variables representing the problem at hand. The end result is the formalization of a p...

متن کامل

Anytime Classification Classifying under Computational Resource Constraints: Anytime Classification Using Probabilistic Estimators

In many online applications of machine learning, the computational resources available for classification will vary from time to time. Existing techniques are designed to operate within the constraints of the minimum expected resources and fail to utilize further resources when they are available. This paper presents an analysis of the relevant categories of computational resource involved and ...

متن کامل

Learning for anytime classification

Many on-line applications of machine learning require that the learned classifiers complete classification within strict real-time constraints. In consequence, efficient classifiers such as naive Bayes (NB) are often employed that can complete the required classification tasks even under peak computational loads. While NB provides acceptable accuracy, more computationally intensive approaches c...

متن کامل

Learning Document Image Features With SqueezeNet Convolutional Neural Network

The classification of various document images is considered an important step towards building a modern digital library or office automation system. Convolutional Neural Network (CNN) classifiers trained with backpropagation are considered to be the current state of the art model for this task. However, there are two major drawbacks for these classifiers: the huge computational power demand for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005